Efficient binary protocol marshalling for rule engine sessions

ABSTRACT

Some embodiments of efficient binary protocol marshalling for rule engine sessions have been presented. In one embodiment, a set of marshalling plug-ins is provided to a rule engine. Each of the set of marshalling plug-ins is customized for a type of user objects. In response to encountering a user object, the rule engine selects a marshalling plug-in out of the set of marshalling plug-ins based on a type of the user object to marshall in or to marshall out the user object.

TECHNICAL FIELD

Embodiments of the present invention relate to artificial intelligence,and more specifically to rule engines.

BACKGROUND

The development and application of rule engines and rules is one branchof Artificial Intelligence (A.I.), which is a very broad research areathat focuses on “making computers think like people.” A rule is alogical construct for describing the operations, definitions,conditions, and/or constraints that apply to some predetermined data toachieve a goal. Broadly speaking, a rule engine processes information byapplying rules to data objects (also known as facts). These data objectsmay include user defined objects referred to as user objects. A dataobject has to be asserted into a working memory of the rule engine inorder for the rule engine to evaluate the data object against somepredetermined rules.

Conventionally, a data object is sent to a rule engine in a serializedform, such as in a binary stream. The rule engine deserializes theincoming binary stream to put the data object into a format usable bythe rule engine. Likewise, to output data objects, the rule engineserializes the data objects to generate an outgoing binary stream.Regardless of the type of data objects, the conventional rule engineserializes the data objects in order to send them out and deserializesincoming binary stream in order to extract data objects from the binarystream.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by wayof limitation, in the figures of the accompanying drawings and in which:

FIG. 1A illustrates one embodiment of a method to marshall in userobjects to a rule engine.

FIG. 1B illustrates one embodiment of a method to marshall out userobjects from a rule engine.

FIG. 2A illustrates one embodiment of a method to analyze session data.

FIG. 2B illustrates some exemplary session data.

FIG. 3 shows one embodiment of a rule engine coupled to a set ofmarshalling plug-ins.

FIG. 4 shows one embodiment of a rule engine.

FIG. 5 shows one embodiment of a system usable with some embodiments ofthe present invention.

FIG. 6 shows an alternate embodiment of a system usable with someembodiments of the present invention.

FIG. 7 illustrates a block diagram of an exemplary computer system.

DETAILED DESCRIPTION

Described herein are some embodiments of efficient binary protocolmarshalling for rule engine sessions. Broadly speaking, marshallingrefers to conversion of data from one format to another format forvarious purposes, such as for transmission, for evaluation againstrules, for storage, etc. The data may include user objects. A userobject as used herein broadly refers to a unit of data organized in auser-defined format. For example, a user object may be a tuple in alinked list in some embodiments. Furthermore, marshalling data into arule engine refers to converting data external to the rule engine into aformat usable by the rule engine. Likewise, marshalling data out of arule engine refers to converting data internal to the rule engine into aformat suitable for transmitting out of the rule engine.

In one embodiment, a set of marshalling plug-ins is provided to a ruleengine. In general, a plug-in of a rule engine refers to a computerprogram that can be added onto the rule engine. Because user objects ofdifferent types have to be converted in different ways, differentmarshalling plug-ins are provided to the rule engine customized for userobjects of different types. Moreover, there may be two marshallingplug-ins for each user object type, one for marshalling user objects ofthe specific type into the rule engine, and one for marshalling the userobjects out of the rule engine. To marshall a particular user object,the rule engine may select one of the marshalling plug-ins availablebased on the user object type. In some embodiments, a defaultmarshalling plug-in may be provided for user objects that have nocustomized marshalling plug-in. More details of some embodiments of therule engine and the marshalling plug-ins are described below.

In the following description, numerous details are set forth. It will beapparent, however, to one skilled in the art, that the present inventionmay be practiced without these specific details. In some instances,well-known structures and devices are shown in block diagram form,rather than in detail, in order to avoid obscuring the presentinvention.

Some portions of the detailed descriptions below are presented in termsof algorithms and symbolic representations of operations on data bitswithin a computer memory. These algorithmic descriptions andrepresentations are the means used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of operations leading to adesired result. The operations are those requiring physicalmanipulations of physical quantities. Usually, though not necessarily,these quantities take the form of electrical or magnetic signals capableof being stored, transferred, combined, compared, and otherwisemanipulated. It has proven convenient at times, principally for reasonsof common usage, to refer to these signals as bits, values, elements,symbols, characters, terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise as apparent from the following discussion,it is appreciated that throughout the description, discussions utilizingterms such as “processing” or “computing” or “calculating” or“determining” or “displaying” or the like, refer to the action andprocesses of a computer system, or similar electronic computing device,that manipulates and transforms data represented as physical(electronic) quantities within the computer system's registers andmemories into other data similarly represented as physical quantitieswithin the computer system memories or registers or other suchinformation storage, transmission, or display devices.

The present invention also relates to apparatus for performing theoperations herein. This apparatus may be specially constructed for therequired purposes, or it may comprise a general-purpose computerselectively activated or reconfigured by a computer program stored inthe computer. Such a computer program may be stored in acomputer-readable storage medium, such as, but is not limited to, anytype of disk including floppy disks, optical disks, CD-ROMs, andmagnetic-optical disks, read-only memories (ROMs), random accessmemories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any typeof media suitable for storing electronic instructions, and each coupledto a computer system bus.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general-purposesystems may be used with programs in accordance with the teachingsherein, or it may prove convenient to construct more specializedapparatus to perform the required operations. The required structure fora variety of these systems will appear from the description below. Inaddition, the present invention is not described with reference to anyparticular programming language. It will be appreciated that a varietyof programming languages may be used to implement the teachings of theinvention as described herein.

FIG. 1A illustrates one embodiment of a method to marshall in userobjects to a rule engine. The method may be performed by a rule engineimplemented with processing logic that may comprise hardware (e.g.,circuitry, dedicated logic, programmable logic, microcode, etc.),software (such as instructions run on a processing device), firmware, ora combination thereof. For example, the computer system 700 in FIG. 7may perform at least part of the method in some embodiments.

Initially, the rule engine core creates an empty session (block 110). Asession (also referred to as a rule engine session or a working memory)as used herein broadly refers to a predetermined period of time in whichdata asserted into a rule engine is evaluated against rules added to therule engine. Note that a session may be stateful or stateless. In astateful session, data can be asserted and modified over time, and rulescan also be added and removed. In contrast, in a stateless session, nomore data can be asserted or modified and rules cannot be added orremoved after the initial data set has been asserted. In other words,there is no rule re-evaluations in a stateless session.

Referring back to FIG. 1A, the rule engine reads in a binary stream ofdata (block 112). A user of the rule engine provides the binary streamof data to the rule engine, which may include a set of one or moreplaceholders for user objects. As mentioned above, a user object as usedherein broadly refers to a unit of data organized in a user-definedformat. Many different types of user objects may be defined to meet theneeds of the user. For example, for a mortgage application, a userobject named “Applicant” may be defined to be an object with a characterelement to hold a name of a mortgage applicant, an integer element tohold the age of the applicant, etc. While reading in the binary stream,the rule engine determines if there is any placeholder for a user objectin the binary stream (block 114). If there is no placeholder in thebinary stream, then the rule engine checks to determine if the end ofthe binary stream has been reached (block 120). If so, the process endsat block 129. Otherwise, the method transitions back to block 112 torepeat the above operations.

If there is a placeholder for a user object in the binary stream, therule engine uses an identification in the placeholder to look up acorresponding marshalling plug-in from a plug-in object type map storedin the rule engine (block 116). In some embodiments, the rule enginemaintains the plug-in object type map to associate user object typeswith their corresponding customized marshalling plug-ins. Then the ruleengine executes the marshalling plug-in found to create a reference tothe user object in the session (block 118). Afterwards, the rule enginechecks to determine if the end of the binary stream has been reached(block 120). If so, the process ends at block 129. Otherwise, the methodtransitions back to block 112 to repeat the above operations.

The marshalling plug-ins implement various marshalling strategies. Auser of the rule engine may code a marshalling plug-in to implement aspecific marshalling strategy. Alternatively, the rule engine may comewith marshalling plug-ins implementing some predefined marshallingstrategies. In some embodiments, there are two marshalling strategies,namely, serialised marshalling strategy and identity marshallingstrategy. Serialized marshalling strategy writes a user object to abinary stream via standard readObject method and writeObject method. Tomarshall out a user object, the identity marshalling strategy assigns anidentification to the user object and places the identification in amap. Then the identification is written to a binary stream. In someembodiments, the identification includes an integer generated from aninteger counter. When marshalling in the user object according to theidentity marshalling strategy, the map is used to look up the userobject. Therefore, the identity marshalling strategy is stateful.Furthermore, the writeObject method can be called only once according tothe identity marshalling strategy, while the readObject method can becalled repeatedly. In some embodiments, the rule engine uses marshallingplug-ins that implement the identity marshalling strategy as the defaultmarshalling plug-ins.

With customized marshalling plug-ins, the rule engine may readily pauseand then resume a session. This is particularly useful in moving asession from one server to another server, or restarting an existingserver. In some embodiments, a snapshot of a session at a particulartime can be taken using the customized marshalling plug-ins. Forexample, a session may be paused and data in the session is thenmarshalled out of the rule engine using marshalling plug-ins customizedfor user objects in the session. Furthermore, the rule engine may takesnapshots at the end of each transaction in the session in order toprovide transaction consistency and high availability.

In some embodiments, pre-loaded session templates are created using thecustomized marshalling plug-ins. Pre-loaded session templates saves timespent inserting data to the rule engine when stateful sessions with thesame base set of data are created repeatedly. For instance, a user maypopulate a session once initially. To create a pre-loaded sessiontemplate, the rule engine writes out the initial session to a binarystream using the appropriate marshalling plug-ins. Then the rule enginemay use this binary stream as the pre-loaded session template to createone or more sessions having the same base set of data in the future.

FIG. 1B illustrates one embodiment of a method to marshall out userobjects from a rule engine. The method may be performed by a rule engineimplemented with processing logic that may comprise hardware (e.g.,circuitry, dedicated logic, programmable logic, microcode, etc.),software (such as instructions run on a processing device), firmware, ora combination thereof. For example, the computer system 700 in FIG. 7may perform at least part of the method in some embodiments.

Referring to FIG. 1B, the rule engine analyzes an existing session(block 210). To analyze the existing session, the rule engine looks atone element at a time in some embodiments. Then the rule engine checksto determine if there is any reference in the session to a user object(block 212). If there is a reference to a user object, then the ruleengine chooses a placeholder for the user object based on the type ofthe user object (block 214). The rule engine then puts the placeholderat a position corresponding to the reference in an outgoing binarystream (block 216) and transitions to block 218.

If there is no reference to a user object, then the rule enginetransitions to block 218 to write information of the existing sessioninto the outgoing binary stream (block 218). The rule engine then checksto determine if it is done with the session (block 220). If not, therule engine transitions back to block 210 to continue the process.Otherwise, the method ends at block 229.

In some embodiments, the rule engine with various marshalling plug-insmay be used to process mortgage applications. A lender may provide a setof predefined business rules (e.g., age >18, monthly income >2× monthlymortgage payment, loan amount <80% of subject property value, etc.),which are input to the rule engine. Information of an applicant and thesubject property may be organized as a set of user objects of varioustypes (e.g., person, assets, income, appraised value of the subjectproperty, etc.). These user objects may be marshalled into or marshalledout of the rule engine as discussed in details above.

FIG. 2A illustrates one embodiment of a method to analyze session data.The method may be performed by a rule engine implemented with processinglogic that may comprise hardware (e.g., circuitry, dedicated logic,programmable logic, microcode, etc.), software (such as instructions runon a processing device), firmware, or a combination thereof. Forexample, the computer system 700 in FIG. 7 may perform at least part ofthe method in some embodiments.

The rule engine first enters an object at block 230. In someembodiments, the rule engine may get or create a referenceidentification (ID) for the object, depending on whether a reference IDof the object already exists, and writes the reference ID to a stream ofbinary data. Then the rule engine begins to process each child of theobject at block 232. The rule engine first determines if the object hasany more children at block 234. If there is at least a child, then therule engine determines if the child is a leaf node at block 236. If thechild is not a leaf node, then the rule engine returns to block 230.Otherwise, if the child is a leaf node, then the rule engine writesprimitive data at block 238, and then returns to block 232.

In some embodiments, if the rule engine determines that the object hasno more children at block 234, the rule engine exits the object at block240 to continue to process a parent of the object. Then the rule enginedetermines if the parent is a root node at block 242. If not, the ruleengine returns to block 232 to continue the method. Otherwise, if theparent is a root node, then the method ends. To further illustrate theabove method, an example is described in details below with reference tothe exemplary session data in FIG. 2B.

FIG. 2B illustrates some exemplary session data. To analyze the sessiondata in FIG. 2B, one embodiment of the rule engine may first enterObject 1 to create a reference ID and write the reference ID to a streamof binary data. Then the rule engine may loop through each child ofObject 1 as described below.

In some embodiments, the children of an object may include fields and/orother objects. Referring to FIG. 2B, Object 1 has the followingchildren: Field 1, Field 2, Object 1.1, and Object 1.2. The rule enginemay write primitive Field 1, and then primitive Field 2. Then the ruleengine may enter Object 1.1 to create another reference ID and write thereference ID to the stream.

Object 1.1 has two children, namely, Field 3 and Object 2.1. The ruleengine writes primitive Field 3, and then enters Object 2.1 to createanother reference ID for Object 2.1 and write the reference ID to thestream. Object 2.1 also has two children, namely, Field 4 and Field 5,which are leaf nodes. Therefore, the rule engine writes primitive Field4 and primitive Field 5. Then the rule engine exits Object 2.1. Becausethe rule engine has completed analysis of all children of Object 1.1 atthis point, the rule engine exits Object 1.1.

In some embodiments, the rule engine then enters Object 1.2 (which isthe last child of Object 1) to create a reference ID for Object 1.2 andwrite it to the stream. Next, the rule engine enters Object 2.2 tocreate a reference ID for Object 2.2 and write it to the stream. Object2.2 has two children, namely, Field 6 and Field 7. The rule enginewrites primitive Field 6 and primitive Field 7. Then the rule engineexits Object 2.2. Next, the rule engine enters Object 1 again becausethe second child of Object 1.2 is a circular reference to Object 1. Therule engine gets and writes the reference ID for Object 1 because thereference ID of Object 1 has already been created. As such, the ruleengine has completely analyzed the exemplary session data in FIG. 2B.

FIG. 3 shows one embodiment of a rule engine 300 coupled to a set ofmarshalling plug-ins 310. The set of marshalling plug-ins 310 includesmarshalling plug-ins customized for some predefined user object types.The rule engine 300 may select a marshalling plug-in out of the set 310to marshall in or marshall out a user object based on the type of theuser object. The set of marshalling plug-ins may further include adefault marshalling plug-in, which may be executed when there is nocustomized marshalling plug-in available for a particular user object.In some embodiments, users may add marshalling plug-ins to the set 310as needed. Likewise, users may remove marshalling plug-ins from the set310 as well. In other words, the marshalling plug-ins 310 are pluggable.

The rule engine 300 includes a storage device to store a plug-in objecttype map 312. The plug-in object type map 312 stores a list of userobject types and the names of their corresponding marshalling plug-ins.When encountering a particular user object in an incoming binary stream301, the rule engine 300 may determine the type of the particular userobject and then look up the corresponding marshalling plug-in from theplug-in object type map 312. If there is no corresponding marshallingplug-in for this particular type of user object, the rule engine 300 mayselect a default marshalling plug-in. Then the rule engine 300 executesthe marshalling plug-in 321 selected to marshall in the particular userobject.

Likewise, when encountering a particular user object in an existingsession, the rule engine 300 may determine the type of the particularuser object and then look up the corresponding marshalling plug-in fromthe plug-in object type map 312. If there is no correspondingmarshalling plug-in for this particular type of user object, the ruleengine 300 may select a default marshalling plug-in. Then the ruleengine 300 executes the marshalling plug-in 329 selected to marshall outthe particular user object. In some embodiments, the marshalling plug-in329 selects a placeholder for the user object based on the type of theuser object and puts the placeholder into the outgoing binary stream 309at a location corresponding to the user object's location in theexisting session.

FIG. 4 shows the details of one embodiment of a rule engine. The ruleengine 400 includes a rule engine core 430, a rule repository 410, and aworking memory 420. In some embodiments, the rule engine core 430 isoperatively coupled to the rule repository 410 and the working memory420. The rule repository 410 stores a rule set having a number of rules.The rule repository 410 may also be referred to as a production memory.The working memory 420 stores data objects (also referred to as facts)that have been asserted. The data objects include one or more userobjects. As discussed in details above, the user objects may bemarshalled into or marshalled out of the rule engine 400 by executingone or more marshalling plug-ins available to the rule engine 400.

In some embodiments, the rule engine core 430 further includes a patternmatcher 432 and an agenda 434. The pattern matcher 432 implements alogical network (such as a Rete network) to evaluate the rules from therule repository 410 against the user objects in the working memory 420.Fully matched rules result in activations, which are placed into theagenda 434 for execution. If a rule fails to be fully matched and thus,no corresponding activation results, then nothing happens.

FIG. 5 illustrates one embodiment of a system usable with someembodiments of the present invention. The system 7100 includes a clientmachine 7110 and a server 7120, which are coupled to each other via anetwork 7130. The client machine 7110 may include a computing machine,such as a desktop personal computer (PC), a laptop PC, a personaldigital assistant (PDA), a mobile telephone, etc. The network 7130coupling the client machine 7110 to the server 7120 may include variouskinds of networks, such as an intranet, the Internet, etc. The server7120 may be implemented using the computer system 700 as illustrated inFIG. 7.

In some embodiments, the server 7120 includes a rule engine 7123 havingan architecture as illustrated in FIG. 4. The client machine 7110 maypresent a GUI 7112 (e.g., a web-page rendered by a browser) to allowusers to input rule sets and/or data objects, which may be sent to theserver 7120 to be processed using the rule engine 7123 as discussedabove.

FIG. 6 illustrates an alternate embodiment of a system usable with someembodiments of the present invention. The system 7200 includes acomputing machine 7150, which may be implemented using the computersystem 700 illustrated in FIG. 7. The computing machine 7150 includes arule engine 7153 and a GUI 7152. In some embodiments, users may inputfiles for rules using the GUI 7152. Then the files may be processed byrule engine 7153 as discussed above.

FIG. 7 illustrates a diagrammatic representation of a machine in theexemplary form of a computer system 700 within which a set ofinstructions, for causing the machine to perform any one or more of themethodologies discussed herein, may be executed. In alternativeembodiments, the machine may be connected (e.g., networked) to othermachines in a LAN, an intranet, an extranet, and/or the Internet. Themachine may operate in the capacity of a server or a client machine inclient-server network environment, or as a peer machine in apeer-to-peer (or distributed) network environment. The machine may be apersonal computer (PC), a laptop PC, a set-top box (STB), a PersonalDigital Assistant (PDA), a cellular telephone, a web appliance, aserver, a network router, a switch or bridge, or any machine capable ofexecuting a set of instructions (sequential or otherwise) that specifyactions to be taken by that machine. Further, while only a singlemachine is illustrated, the term “machine” shall also be taken toinclude any collection of machines that individually or jointly executea set (or multiple sets) of instructions to perform any one or more ofthe methodologies discussed herein.

The exemplary computer system 700 includes a processing device 702, amain memory 704 (e.g., read-only memory (ROM), flash memory, dynamicrandom access memory (DRAM) such as synchronous DRAM (SDRAM), etc.), astatic memory 706 (e.g., flash memory, static random access memory(SRAM), etc.), and a data storage device 718, which communicate witheach other via a bus 732.

Processing device 702 represents one or more general-purpose processingdevices such as a microprocessor, a central processing unit, or thelike. More particularly, the processing device may be complexinstruction set computing (CISC) microprocessor, reduced instruction setcomputing (RISC) microprocessor, very long instruction word (VLIW)microprocessor, or processor implementing other instruction sets, orprocessors implementing a combination of instruction sets. Processingdevice 702 may also be one or more special-purpose processing devicessuch as an application specific integrated circuit (ASIC), a fieldprogrammable gate array (FPGA), a digital signal processor (DSP),network processor, or the like. The processing device 702 is configuredto execute the rule engine with marshalling plug-ins 726 for performingthe operations and steps discussed herein.

The computer system 700 may further include a network interface device708. The computer system 700 also may include a video display unit 710(e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)), analphanumeric input device 712 (e.g., a keyboard), a cursor controldevice 714 (e.g., a mouse), and a signal generation device 716 (e.g., aspeaker).

The data storage device 718 may include a machine-accessible storagemedium 730 (also known as a machine-readable storage medium) on which isstored one or more sets of instructions (e.g., rule engine withmarshalling plug-ins 722) embodying any one or more of the methodologiesor functions described herein. The rule engine with marshalling plug-ins722 may also reside, completely or at least partially, within the mainmemory 704 and/or within the processing device 702 during executionthereof by the computer system 700, the main memory 704 and theprocessing device 702 also constituting machine-accessible storagemedia. The rule engine with marshalling plug-ins 722 may further betransmitted or received over a network 720 via the network interfacedevice 708.

While the machine-readable storage medium 730 is shown in an exemplaryembodiment to be a single medium, the term “computer-readable storagemedium” should be taken to include a single medium or multiple media(e.g., a centralized or distributed database, and/or associated cachesand servers) that store the one or more sets of instructions. The term“computer-readable storage medium” shall also be taken to include anymedium that is capable of storing, encoding or carrying a set ofinstructions for execution by the machine and that cause the machine toperform any one or more of the methodologies of the present invention.The term “computer-readable storage medium” shall accordingly be takento include, but not be limited to, solid-state memories, optical andmagnetic media, etc.

The module, rule engine with marshalling plug-ins 728, components andother features described herein (for example, in relation to FIG. 3) canbe implemented as discrete hardware components or integrated into thefunctionalities of hardware components, such as ASICS, FPGAs, DSPs, orsimilar devices. In addition, the rule engine with marshalling plug-ins728 can be implemented as firmware or functional circuitries withinhardware devices. Further, the rule engine with marshalling plug-ins 728can be implemented in any combination of hardware devices and softwarecomponents.

Thus, some embodiments of efficient binary protocol marshalling for ruleengine sessions have been described. It is to be understood that theabove description is intended to be illustrative, and not restrictive.Many other embodiments will be apparent to those of skill in the artupon reading and understanding the above description. The scope of theinvention should, therefore, be determined with reference to theappended claims, along with the full scope of equivalents to which suchclaims are entitled.

What is claimed is:
 1. A computer-implemented method comprising:providing, by a processing device running on a server, one or moremarshalling plug-ins to a rule engine, each of the one or more plug-inscustomized for a type of user objects; and in response to encountering auser object, the rule engine, running on the server, selecting amarshalling plug-in out of the one or more marshalling plug-ins based ona type of the user object to perform at least one of marshalling in andmarshalling out the user object.
 2. The method of claim 1, furthercomprising: the rule engine, running on the server, creating an emptysession; the rule engine, running on the server, reading in a binarystream of data comprising session data having one or more placeholdersof the user object; the rule engine, running on the server, using anidentification in the placeholder to look up the marshalling plug-infrom a plug-in object type map; and the rule engine, running on theserver, executing the marshalling plug-in to create a reference to theuser object in the session.
 3. The method of claim 1, furthercomprising: the rule engine, running on the server, analyzing anexisting session for a rule engine, the session comprising a referenceto the user object; the rule engine, running on the server, writinginformation of the existing session into an outgoing binary stream ofdata; and the rule engine, running on the server, executing themarshalling plug-in to put a placeholder at a position corresponding tothe reference to the user object in the outgoing binary stream based onthe type of the user object without putting the reference to the userobject into the outgoing binary stream.
 4. The method of claim 1,wherein the one or more marshalling plug-ins comprise: a firstmarshalling plug-in implementing a serialized marshalling strategy. 5.The method of claim 1, wherein the one or more marshalling plug-inscomprise: a second marshalling plug-in implementing an identitymarshalling strategy.
 6. The method of claim 1, wherein the one or moremarshalling plug-ins comprise: a second marshalling plug-in implementingan identity marshalling strategy, which is a default marshallingstrategy to be chosen when none of the one or more plug-ins iscustomized for the type of the user object.
 7. An apparatus comprising:a set of one or more marshalling plug-ins, each of the one or moremarshalling plug-ins customized for a type of user objects; and a ruleengine logically coupled to the set of one or more marshalling plug-ins,to select a marshalling plug-in out of the set of one or moremarshalling plug-ins when encountering a user object based on a type ofthe user object, and to execute the marshalling plug-in selected toperform at least one of marshalling in and marshalling out the userobject.
 8. The apparatus of claim 7, wherein the rule engine furthercomprises: a storage device to store a plug-in object type map, whereinthe rule engine is operable to create an empty session, to read in abinary stream of data having a placeholder of the user object, to lookup the marshalling plug-in from the plug-in object type map using anidentification in the placeholder, and to execute the marshallingplug-in to create a reference to the user object in the session.
 9. Theapparatus of claim 7, wherein the rule engine is operable to analyze anexisting session having a reference to the user object, to writeinformation of the existing session into an outgoing binary stream ofdata, and to execute the marshalling plug-in to put a placeholder at aposition corresponding to the reference to the user object in theoutgoing binary stream without putting the reference to the user objectinto the outgoing binary stream.
 10. The apparatus of claim 7, whereinthe one or more marshalling plug-ins comprise: a first marshallingplug-in implementing a serialized marshalling strategy.
 11. Theapparatus of claim 7, wherein the one or more marshalling plug-inscomprise: a second marshalling plug-in implementing an identitymarshalling strategy.
 12. The apparatus of claim 7, wherein the one ormore marshalling plug-ins comprise: a second marshalling plug-inimplementing an identity marshalling strategy, which is a defaultmarshalling strategy to be chosen when none of the one or more plug-insis customized for the type of the user object.
 13. The apparatus ofclaim 7, wherein the rule engine further comprises: a rule repository tostore a rule set having a plurality of rules usable to evaluate the userobject.
 14. The apparatus of claim 7, wherein the rule engine furthercomprises a working memory to temporarily store the user object afterthe user object has been marshalled into the rule engine.
 15. Theapparatus of claim 7, wherein the rule engine is executed on a server;and the binary stream of data is transmitted to the server by a clientmachine communicatively coupled to the server via a network.
 16. Acomputer-readable storage medium that provides instructions that, whenexecuted by a processor, will cause the processor to perform operationscomprising: providing one or more marshalling plug-ins to a rule engine,each of the one or more plug-ins customized for a type of user objects;and in response to encountering a user object, causing the rule engineto select a marshalling plug-in out of the one or more marshallingplug-ins based on a type of the user object to perform at least one ofmarshalling in and marshalling out the user object.
 17. Thecomputer-readable storage medium of claim 16, wherein the operationsfurther comprise: creating an empty session for the rule engine core;reading in a binary stream of data comprising session data having one ormore placeholders of the user object; using an identification in theplaceholder to look up the marshalling plug-in from a plug-in objecttype map; and executing the marshalling plug-in to create a reference tothe user object in the session.
 18. The computer-readable storage mediumof claim 16, wherein the operations further comprise: analyzing anexisting session for a rule engine core, the session comprising areference to the user object; writing information of the existingsession into an outgoing binary stream of data; and executing themarshalling plug-in to put a placeholder at a position corresponding tothe reference to the user object in the outgoing binary stream based onthe type of the user object without putting the reference to the userobject into the outgoing binary stream.
 19. The computer-readablestorage medium of claim 16, wherein the one or more marshalling plug-inscomprise: a first marshalling plug-in implementing a serializedmarshalling strategy.
 20. The computer-readable storage medium of claim16, wherein the one or more marshalling plug-ins comprise: a secondmarshalling plug-in implementing an identity marshalling strategy. 21.The computer-readable storage medium of claim 16, wherein the one ormore marshalling plug-ins comprise: a second marshalling plug-inimplementing an identity marshalling strategy, which is a defaultmarshalling strategy to be chosen when none of the one or more plug-insis customized for the type of the user object.